1
کامپیوتر و شبکه::
ماتریس مجاورت، ماتریس مجاورت
One intuitive representation is called an adjacency matrix.
An adjacency matrix is just a node-by-node grid of 0s and 1s, where a 1 in a particular cell means "put an edge here" and a 0 means "these nodes are unconnected."
You can create an adjacency matrix out of the Friends data, as shown in Figure 5.2 (the matrix looks a bit like a Galaga-style lobster to me).
If Joey has an edge with Rachel, then the converse is true, and the adjacency matrix shows this.
Figure 5.2 An adjacency matrix for the Friends data،Oddball uses the features of egonet such as degree of the ego, its total weight, number of edges in the egonet, and principal eigenvalue of the weighted adjacency matrix of the egonet to detect anomalies.
AUTOPART automatically partitions the network into clusters by re-organizing the rows and columns of the adjacency matrix.
For clustering the network, the algorithm employs Minimum De- scription Length (MDL) principle (Rissanen, 1999) for re-organiz- ing the adjacency matrix of the graph into homogeneous blocks.
The low-rank approximation of adjacency matrix A is nor-
(a) Matrix/Tensor decomposition-based approaches: The decom- position-based methods identify anomalies by decomposing the adjacency matrix or tensor representation of the dynamic net- works and by analyzing the eigenvectors, eigenvalues, or singular values appropriately (Sun et al.
واژگان شبکه مترجمین ایران